Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
61	Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs Mohamed Sarwat1 1 Sameh Elnikety2 Add to Reading List Source URL: www-users.cs.umn.edu Language: English - Date: 2015-04-07 00:37:53 Database management systems SQL Query optimizer Search algorithms Reachability Graph partition Query plan Breadth-first search FO Graph theory Theoretical computer science Mathematics
62	102 complexity of the resulting asynchronous algorithm depends on the overhead introduced by the synchronizer. For a synchronizer S, let T (S) and M (S) be the time and message complexities of S for each generated clock Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed computing Electronics Clock synchronization Clock skew Breadth-first search Computing Computer programming Distributed algorithms Synchronizer Synchronization
63	The University of Hong Kong, Dept. of Electrical & Electronic Engineering, Technical Report TR, JanHierarchy-based algorithm for the influence maximization problem in social networks Add to Reading List Source URL: www.eee.hku.hk Language: English - Date: 2015-01-27 01:27:36 Graph theory Network theory Combinatorics Distributed data storage Combinatorial optimization A* search algorithm Network topology Centrality Breadth-first search Routing algorithms Mathematics Search algorithms
64	Solving Large, Irregular Graph Problems using Adaptive Work-stealing Guojing Cong (IBM) Sreedhar Kodali (IBM) Sriram Krishnamoorthy (Ohio State) Doug Lea (SUNY Oswego) Vijay Saraswat (IBM) Add to Reading List Source URL: gee.cs.oswego.edu Language: English - Date: 2008-07-07 20:18:19 Search algorithms Spanning tree Depth-first search Breadth-first search Minimum spanning tree Planar graph Cilk Graph traversal Ear decomposition Graph theory Mathematics Theoretical computer science
65	The Filter-Placement Problem and its Application to Minimizing Information Multiplicity Dora Vatche Ishakian Andrei Lapets Evimaria Terzi Azer Bestavros ´ Erdos ¨ Add to Reading List Source URL: vldb.org Language: English - Date: 2012-01-21 14:29:58 Network theory Networks Search algorithms Network flow Directed acyclic graph Centrality Breadth-first search Flow network Shortest path problem Graph theory Mathematics Theoretical computer science
66	Chapter 4 Paths in graphs 4.1 Distances Depth-first search readily identifies all the vertices of a graph that can be reached from a designated starting point. It also finds explicit paths to these vertices, summarized Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 04:59:12 Search algorithms Routing algorithms Network theory Breadth-first search Depth-first search Shortest path problem Distance Graph Connectivity Mathematics Graph theory Theoretical computer science
67	Relational Approach for Shortest Path Discovery over Large Graphs Jun Gao† Ruoming Jin§ Jiashuai Zhou† Jeffrey Xu Yu‡ Xiao Jiang† Tengjiao Wang† † ‡ Add to Reading List Source URL: vldb.org Language: English - Date: 2011-12-25 09:36:26 Search algorithms Network theory Routing algorithms Shortest path problem Breadth-first search Tree Graph Flow network Minimum spanning tree Mathematics Graph theory Theoretical computer science
68	Resisting Structural Re-identification in Anonymized Social Networks Michael Hay, Gerome Miklau, David Jensen, Don Towsley, Philipp Weis Department of Computer Science University of Massachusetts Amherst {mhay,miklau,jen Add to Reading List Source URL: www.vldb.org Language: English - Date: 2008-10-22 09:22:53 Graph Degree distribution Centrality Bipartite graph Scale-free network Shortest path problem Breadth-first search Connectivity Topology Graph theory Mathematics Network theory
69	Efficient Large-Scale Model Checking∗ Kees Verstoep, Henri E. Bal Jiˇr´ı Barnat, Luboˇs Brim Dept. of Computer Science, Fac. of Sciences Add to Reading List Source URL: www.cs.vu.nl Language: English - Date: 2009-02-12 11:31:56 Search algorithms Application programming interfaces Parallel computing Breadth-first search Message Passing Interface Depth-first search Model checking Graph Distributed computing Mathematics Graph theory Theoretical computer science
70	tunning_parameter_running_time_machine_number.eps Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-11-12 16:57:53 NP-complete problems Network theory Graph coloring Graph partition Shortest path problem Connectivity Minimum spanning tree Breadth-first search Theoretical computer science Graph theory Mathematics

UPDATE